A Distributed Hierarchical Programming Model for Heterogeneous Cluster of SMPs
نویسندگان
چکیده
Cluster systems are getting increasingly popular since they provide large computational power at a reasonable price. The cluster nodes are often SMPs with a small number of processors that can access a shared address space. The nodes are connected by a network like Myrinet or SCI, so the global address space is distributed. In this paper, we present a new programming model for such clusters of SMPs. The model allows the programmer to adapt his program to the two-level structure of the address space by providing a micro-level and a macro-level. The micro-level allows a thread formulation of multiprocessor tasks that are executed within a node of the cluster system. The macro-level allows the hierarchical structuring of multiprocessortasks according to the structure of the algorithm using message passing for data-exchange. We demonstrate the usefulness of the approach by runtime tests on several cluster systems with different node architectures and different interconnection networks.
منابع مشابه
Technische Universität Chemnitz Sonderforschungsbereich 393 Numerische Simulation auf massiv parallelen Rechnern
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredictable access behavior to dynamically changing data structures or strong irregular coupling of computations. Problems are an unknown load distribution and expensive irregular communication patterns for data accesses and...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملDeveloping a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming
In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...
متن کاملHierarchical Matrix-Matrix Multiplication Based on Multiprocessor Tasks
We consider the realization of matrix-matrix multiplication and propose a hierarchical algorithm implemented in a task-parallel way using multiprocessor tasks on distributed memory. The algorithm has been designed to minimize the communication overhead while showing large locality of memory references. The task-parallel realization makes the algorithm especially suited for cluster of SMPs since...
متن کاملExperiments with Cholesky Factorization on Clusters of SMPs
Cholesky factorization of large dense matrices is an integral part of many applications in science and engineering. In this paper we report on experiments with different parallel versions of Cholesky factorization on modern high-performance computing architectures. For the parallelization of Cholesky factorization we utilized various standard linear algebra software packages and present perform...
متن کامل